The expected number of critical percolation clusters intersecting a line segment
نویسندگان
چکیده
We study critical percolation on a regular planar lattice. Let EG(n) be the expected number of open clusters intersecting or hitting the line segment [0, n]. (For the subscript G we either take H, when we restrict to the upper halfplane, or C, when we consider the full lattice). Cardy [2] (see also Yu, Saleur and Haas [11]) derived heuristically that EH(n) = An + √ 3 4π log(n) + o(log(n)), where A is some constant. Recently Kovács, Iglói and Cardy derived in [5] heuristically (as a special case of a more general formula) that a similar result holds for EC(n) with the constant √ 3 4π replaced by 5 √ 3 32π . In this paper we give, for site percolation on the triangular lattice, a rigorous proof for the formula of EH(n) above, and a rigorous upper bound for the prefactor of the logarithm in the formula of EC(n).
منابع مشابه
THE SCALING LAW FOR THE DISCRETE KINETIC GROWTH PERCOLATION MODEL
The Scaling Law for the Discrete Kinetic Growth Percolation Model The critical exponent of the total number of finite clusters α is calculated directly without using scaling hypothesis both below and above the percolation threshold pc based on a kinetic growth percolation model in two and three dimensions. Simultaneously, we can calculate other critical exponents β and γ, and show that the scal...
متن کاملExcess number of percolation clusters on the surface of a sphere
Monte Carlo simulations were performed in order to determine the excess number of clusters b and the average density of clusters nc for the two-dimensional “Swiss cheese” continuum percolation model on a planar L×L system and on the surface of a sphere. The excess number of clusters for the L× L system was confirmed to be a universal quantity with a value b = 0.8841 as previously predicted and ...
متن کاملJa n 20 09 Bounds for the return probability of the delayed random walk on finite percolation clusters in the critical case
By an eigenvalue comparison-technique[20], the expected return probability of the delayed random walk on critical Bernoulli bond percolation clusters on the twodimensional Euclidean lattice is estimated. The results are generalised to invariant percolations on unimodular graphs with almost surely finite clusters. The approach involves using the special property of cartesian products of finite g...
متن کاملScaling Limit for the Incipient Spanning Clusters
Scaling limits of critical percolation models show major differences between low and high dimensional models. The article discusses the formulation of the continuum limit for the former case. A mathematical framework is proposed for the direct description of the limiting continuum theory. The resulting structure is expected to exhibit strict conformal invariance, and facilitate the mathematical...
متن کاملMinimal spanning forests
We study minimal spanning forests in infinite graphs, which are weak limits of minimal spanning trees from finite subgraphs corresponding to i.i.d. random labels on the edges. These limits can be taken with free or wired boundary conditions, and are denoted FMSF (free minimal spanning forest) and WMSF (wired minimal spanning forest), respectively. The WMSF is also the union of the trees that ar...
متن کامل